Criteria for apwenian sequences

نویسندگان

چکیده

In 1998, Allouche, Peyrière, Wen and showed that the Hankel determinant Hn of Thue-Morse sequence over {?1,1} satisfies Hn/2n?1?1(mod2) for all n?1. Inspired by this result, Fu Han introduced apwenian sequences {?1,1}, namely, ±1 whose determinants satisfy n?1, proved with computer assistance a few are apwenian. paper, we obtain an easy to check criterion sequences, which allows us determine fixed points substitutions constant length. Let f(z) be generating functions such sequences. We show integer b?2 f(1/b)?0, real number f(1/b) is transcendental its irrationality exponent equal 2. Besides, also derive 0-1 Hn?1(mod2) find only sequence, among length, period-doubling sequence. Various examples given projection provided. Furthermore, prove Sturmian or {0,1} not And conjecture substitution non-constant length can

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New stopping criteria for segmenting DNA sequences.

We propose a solution on the stopping criterion in segmenting inhomogeneous DNA sequences with complex statistical patterns. This new stopping criterion is based on Bayesian information criterion in the model selection framework. When this criterion is applied to telomere of S. cerevisiae and the complete sequence of E. coli, borders of biologically meaningful units were identified, and a more ...

متن کامل

Criteria of regularity for norm-sequences. II

Abstract. The regularity property of a norm-sequence ρ(n) = ‖Tn‖ (n ∈ N) ensures that the operator T can be intertwined with an isometry V , which relation can be exploited to obtain a lot of information for T itself, as it was shown in [1] and [2]. In [3] general sufficient conditions of regularity were provided. In the present note a necessary and sufficient condition of regularity is given. ...

متن کامل

Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences

In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence of rules is applicable (resp. not applicable) on a given graph? Of course, it is possible to use a trial and error strategy to find out the answer to these questions. In this paper however, we will formulate suitable sufficien...

متن کامل

Enumeration and criteria for cyclically shift-distinct GMW sequences

GMW sequences (also called cascaded GMW sequences) have two-level autocor-relations. This property makes them widely used in various communication and cryptographic systems. The generation of q?ary GMW sequences of period q n ? 1 involves three types of parameters. To determine whether GMW sequence are cyclically shift distinct for diiering parameters has remained an open question until now. In...

متن کامل

Selection Criteria for (Random) Generation of Digital (0,s)-Sequences

Among the very general scramblings introduced by A. Owen [Owe95], simple and widely used scramblings are obtained by S. Tezuka [Tez94]–[Tez95] by multiplying on the left the upper triangular generator matrices by nonsingular lower triangular (NLT) matrices whose entries are randomly chosen in the set of digits {0, 1, . . . , b − 1} identified to Fb. For these special scramblings we propose to s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2021

ISSN: ['1857-8365', '1857-8438']

DOI: https://doi.org/10.1016/j.aim.2021.107899